heuristic routing
英 [hjuˈrɪstɪk ˈraʊtɪŋ]
美 [hjuˈrɪstɪk ˈraʊtɪŋ]
网络 启发式路由选择
双语例句
- Heuristic computing method of bidirectional searching routing with multiple restrictions
双向搜索多约束路由启发式计算方法 - Study on Hybrid Genetic Heuristic Algorithm for Vehicle Routing Problem with Backhauls
一体化集货和配送车辆路径问题的混合遗传启发式算法 - Research on a genetic algorithm for heuristic shortest path routing
一种启发式SP路由遗传算法的研究 - New Ant Heuristic Algorithm for Degree-Constrained Multicast Routing
求解度约束组播路由的新型蚁群算法 - Heuristic Genetic Algorithm for QoS Multicast Routing
QoS组播路由的启发式遗传算法 - Model and heuristic solution for location routing problems of logistics network
物流网络选址与路径优化问题的模型与启发式解法 - In this article, after typical heuristic algorithms on unicast multi-constrained routing are analyzed, the comparison and summary are given.
对当前提出的各种单播启发式多约束路由算法进行了分析、比较，总结了各种算法的特点。 - In this paper, we study a network model in which each network node and link are associated with a set of parameters. We propose a new heuristic algorithm for QoS routing with multiple constraints.
主要研究在网络节点和链路上均有限制条件的网络模型，并提出了一种多限制条件下的QoS路由算法。 - Due to heuristic rules, high efficiency and routing completion rate are obtained by the algorithm.
最后，对仍然没有完成连接的线网，用李氏算法布线。由于使用了启发式规则，使得该算法具有较高的布通率和布线效率。 - Based on the analysis of the existing heuristic algorithm for the vehicle routing problem ( VRP), an improved genetic algorithm ( IGA) is presented for the solution of this problem.
在分析车辆路线问题（VRP）现有启发式算法的基础上，提出了求解该问题的一种改进遗传算法（IGA）。 - In this paper, according to heuristic routing rules and constraint relation of pins, we propose a concept of constraint link and construct a distance function to solve the conflicts in constraint link.
本文根据端点分配中的一些启发式原则以及端点间的制约关系，提出了制约关系链的概念，并为解决链中的矛盾构造了距离函数。 - Then, the group multicast routing problem with bandwidth constrained is studied, and by the idea of the algorithm for the kidnap problem, a global heuristic algorithm for the group multicast routing problem is presented;
此外，本论文还研究了有带宽预留机制的组内多播路由问题，并且根据解决多重背包问题的算法思想给出了一种全局启发式组内多播路由算法； - A Key-node Based Dynamic Heuristic Minimal Spanning Tree Multicast Routing Algorithm
基于关键节点的动态多播最小生成树算法 - Improved Heuristic Genetic Algorithm for Multicast Routing on Multiple Constrained QoS
解决多约束QoS组播路由问题的遗传算法 - A Heuristic Algorithm for Delay-constrained Least-cost Unicast Routing
一种时延约束最小代价路由选择算法 - A heuristic algorithm for vehicle routing
车辆路径问题（VRP）的一个启发式算法 - Hybrid Ants Heuristic for Capacity Vehicle Routing Problem
有容量限制路径选择优化问题的混合蚂蚁算法 - Realization and simulation of heuristic algorithm in QoS routing
启发式QoS路由选择算法的实现与仿真 - Research on heuristic algorithm in multi-constraints QoS routing
一种启发式算法在多受限QoS路由中的研究 - In this paper, the formula of heuristic search algorithms is generalized, and a weighted heuristic QoS routing selection algorithm based on cost and delay is presented.
本文推广启发式搜索算法公式，提出了一种基于费用和延迟的加权启发式QoS路由选择算法。 - A Heuristic Algorithm for Delay-Bandwidth-Constrained Multicast Routing
一种基于延时及带宽受限的启发式组播路由算法 - An Adjustable Heuristic Algorithm for Multi-Constrained Routing Problem
性能可调的启发式多约束路由算法 - Adopting the strategy of layered bandwidth allocation, a heuristic routing algorithm, called layered compact tree ( LCT) is proposed to build a minimum delay radius multicast tree in heterogeneous OMN. The properties of LCT are also proved and analyzed in theory.
采用分层的带宽分配策略，提出了一种异构环境下构造OMN最小延时半径多播树的启发式算法&分层的压缩树（layeredcompacttree，简称LCT）算法，并对其性质进行了理论证明和分析。 - Simulation results show that the probability-based heuristic algorithm can compress routing table greatly.
仿真表明该算法能够很大程度压缩路由表。 - The simulation results show that the two proposed routing algorithms not only can get lower burst packet loss probability but also be higher efficiency and be more suitable for solving the complex model than other heuristic routing algorithms.
仿真实验表明，本文所使用的路由优化方法相比于传统的启发式路由算法能够获得更低的全网突发丢包率，不仅具有更高的效率，而且适用于复杂模型的优化求解，具有较高的实用价值。 - And then an ILP formulation and a heuristic algorithm of routing design for carrying Ethernet services with multi-paths in ASON are proposed.
进而，本文提出了新的，基于SDH的ASON多径传输以太网业务路由设计的ILP算法和启发式算法，进行了仿真实验与分析。 - In the second part, we discuss the significant of delay variation in some multicast applications. We also present a heuristic algorithm for multicast routing problem with delay and delay variation constraints.
然后，论文分析限制时延抖动对某些多播应用的重要意义，并就时延和时延抖动约束的多播路由问题提出了一种新的链路选择函数。 - Based on previous studies of the static optimal path algorithm, this paper summed up the common routing algorithm. The final design achieved a heuristic leg routing algorithm.
在研究前人研究的静态最优路径算法的基础上，主要总结了常见的寻径算法，最终设计实现了启发式航段寻径算法。 - Considering that the traditional multi decomposition algorithm is easy to get into partial optimization solution, and not overall optimization solution, the study deign hybrid heuristic algorithm to solve the location routing problem model of picking-delivery as a whole.
由于传统的多级分解算法易陷入局部最优解，而不是全局最优。因此，本文从整体上设计混合启发式算法求解一体化配送与集货的定位-运输路线安排问题。 - Recently, scholars generally use heuristic algorithm to solve anycast routing problem with multiple QoS constraints, and one has vividly applied ant colony algorithm in the anycast routing problem and get good performance.
当今学者多采用启发式算法来解决多QoS约束的选播路由问题，并有国内学者将蚁群算法形象地应用在选播路由问题上并取得较为良好的运算结果。